package com.myth;

import org.junit.Test;

public class 面试题 {

    public int accountsTest(Integer[][] account){
        int[] sum = new int[account.length];
        for (int i = 0; i < account.length; i++) {
            for (int j = 0; j < account[i].length; j++) {
                sum[i] += account[i][j];
            }
        }
        int sumMax = 0;
        for (int i = 0; i < sum.length; i++) {
            sumMax = sum[i];
            if (sum[i] > sumMax) {
                sumMax = sum[i];
            }
        }
        return sumMax;
    }


    class ListNode{
        ListNode next;
        int value;
    }
    public void deleteNode(ListNode node){
        // 感觉少了当前节点的头节点;
        ListNode pre,nextNode;
        if (node.next != null) {
            nextNode = node.next;
            node = nextNode;
        }
    }

    public int[] merge(int[] nums1,int[] nums2,int m,int n){
        for (int i = 0; i < nums2.length; i++) {
            nums1[m-1+i] = nums2[i];
        }

        for (int i = 0; i < m+n; i++) {
            for (int j = 0; j < ; j++) {

            }
        }

        return nums1;
    }


}
